A numerical solver for general bordered tridiagonal matrix equations
نویسندگان
چکیده
منابع مشابه
A numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملBCYCLIC: A parallel block tridiagonal matrix cyclic solver
A block tridiagonal matrix is factored with minimal fill-in using a cyclic reduction algorithm that is easily parallelized. Storage of the factored blocks allows the application of the inverse to multiple right-hand sides which may not be known at factorization time. Scalability with the number of block rows is achieved with cyclic reduction, while scalability with the block size is achieved us...
متن کاملNew Symbolic Algorithms For Solving A General Bordered Tridiagonal Linear System
X iv :1 30 3. 07 38 v1 [ cs .S C ] 4 M ar 2 01 3 New Symbolic Algorithms For Solving A General Bordered Tridiagonal Linear System A. A. KARAWIA∗ Computer science unit, Deanship of educational services, Qassim University, P.O.Box 6595, Buraidah 51452, Saudi Arabia. E-mail: [email protected] Abstract In this paper, the author present reliable symbolic algorithms for solving a general bordered tri...
متن کاملA New Symbolic Algorithm for Solving General Opposite-Bordered Tridiagonal Linear Systems
In the current article we propose a new efficient, reliable and breakdown-free algorithm for solving general opposite-bordered tridiagonal linear systems. An explicit formula for computing the determinant of an opposite-bordered tridiagonal matrix is investigated. Some illustrative examples are given.
متن کاملA Parallel Algorithm for Solving General Tridiagonal Equations
A parallel algorithm for the solution of the general tridiagonal system is presented. The method is based on an efficient implementation of Cramer's rule, in which the only divisions are by the determinant of the matrix. Therefore, the algorithm is defined without pivoting for any nonsingular system. 0(n) storage is required for n equations and (?(log n) operations are required on a parallel co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2016
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2016.09.025